A Path Planning Algorithm using Generalized Potential Model for Hyper- Redundant Robots with 2-DOF Joints

نویسندگان

  • Chien-Chou Lin
  • Jen-Hui Chuang
  • Cheng-Tieng Hsieh
چکیده

This paper proposes a potential‐based path planning algorithm of articulated robots with 2‐DOF joints. The algorithm is an extension of a previous algorithm developed for 3‐DOF joints. While 3‐DOF joints result in a more straightforward potential minimization algorithm, 2‐DOF joints are obviously more practical for active operations. The proposed approach computes repulsive force and torque between charged objects by using generalized potential model. A collision‐free path can be obtained by locally adjusting the robot configuration to search for minimum potential configurations using these force and torque. The optimization of path safeness, through the innovative potential minimization algorithm, makes the proposed approach unique. In order to speedup the computation, a sequential planning strategy is adopted. Simulation results show that the proposed algorithm works well compared with 3‐DOF‐joint algorithm, in terms of collision avoidance and computation efficiency.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Path Planning of a 3 DOF Servo-Hydraulic Mechanism Using Genetic Algorithm

The objective of this paper is path planning of a 3 DOF planer robot with hydraulic actuator using genetic algorithm. First the geometric and kinematic parameters of robot were established. The equations of motion are derived by Lagrange method. We proposed the model for proportional valve and hydraulic actuators. Then using the genetic algorithm we minimized the hydraulic energy consumption as...

متن کامل

In Proceedings of the 1992 IEEE International Conference on Intelligent Robots and Systems ( IROS ’ 92 ) A Continuous Approach to Robot Motion Planning with Many Degrees of Freedom

There is a need for highly redundant manipulators to work in complex, cluttered environments. We explore kinematics and path planning for highly redundant manipulators by means of a continuous manipulator model, which captures the macroscopic shape of highly redundant manipulators. A path for the continuous manipulator model can be found by nding a smooth path for its end-e ector under a maximu...

متن کامل

A Potential-based Path Planning Algorithm for Hyper-redundant Manipulators

A novel collision avoidance algorithm based on the generalized potential model is proposed to solve the path-planning problem of hyper-redundant manipulators in 3D workspace. The approach computes repulsive force and torque between manipulator and obstacles by using the workspace information directly. A collision-free path for a manipulator can then be obtained by locally adjusting the manipula...

متن کامل

Formation Control and Path Planning of Two Robots for Tracking a Moving Target

This paper addresses the dynamic path planning for two mobile robots in unknownenvironment with obstacle avoidance and moving target tracking. These robots must form atriangle with moving target. The algorithm is composed of two parts. The first part of thealgorithm used for formation planning of the robots and a moving target. It generates thedesired position for the robots for the next step. ...

متن کامل

Inverse Kinematics Resolution of Redundant Cooperative Manipulators Using Optimal Control Theory

The optimal path planning of cooperative manipulators is studied in the present research. Optimal Control Theory is employed to calculate the optimal path of each joint choosing an appropriate index of the system to be minimized and taking the kinematics equations as the constraints. The formulation has been derived using Pontryagin Minimum Principle and results in a Two Point Boundary Value Pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011